package 蓝桥杯算法;

public class day666 {
    public static void main(String[] args) {
        int n=3;
        int m=4;
int[][] arr={{1,3,5,7},{9,8,7,6},{3,5,9,7}};
int[][] arr1=new int[4][3];
       for(int i=0;i<n;i++){
           for(int j=0;j<m;j++){
               arr1[j][n-i-1]=arr[i][j];
           }
       }
       for(int i=0;i<4;i++){
           for(int j=0;j<3;j++){
               System.out.print(arr1[i][j]);
           }
           System.out.println();
       }
       int sum=1;
       int[] a=new int[20190324];
       a[0]=1;
       a[1]=1;
       a[2]=1;
       for(int i=3;i<20190324;i++){
           a[i]=a[i-1]+a[i-2]+a[i-3];
       }
        System.out.println(a[20190323]);
    }



}
